package com.ease;

import java.util.HashMap;
import java.util.Map;

public class ONE_TwoNumberAdd {
    public static void main(String[] args) {
        int num[] = new int[]{2,  11,7, 15};
        int target = 9;

        ONE_TwoNumberAdd twoNumberAdd = new ONE_TwoNumberAdd();
        int[] result = twoNumberAdd.twoSum(num, target);
        System.out.println("结果：[" + result[0] + ", " + result[1] + "]");
    }

    public int[] twoSum(int[] nums, int target) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(target - nums[i])) {
                return new int[]{map.get(target - nums[i]), i};
            }
            map.put(nums[i], i);
        }
        throw new IllegalArgumentException("No two sum solution");
    }
}
